Comment on "Clustering by passing messages between data points".

نویسندگان

  • Michael J Brusco
  • Hans-Friedrich Köhn
چکیده

Frey and Dueck (Reports, 16 February 2007, p. 972) described an algorithm termed "affinity propagation" (AP) as a promising alternative to traditional data clustering procedures. We demonstrate that a well-established heuristic for the p-median problem often obtains clustering solutions with lower error than AP and produces these solutions in comparable computation time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Replication on Affinity Propagation: Clustering by Passing Messages Between Data Points

In this project, I choose the paper, Clustering by Passing Messages Between Data Points [1], published in Science 2007, as the work to replicate. In [1], a new clustering algorithm named Affinity Propagation is proposed. In my report, three research hypothesizes in this paper that are related to the performance, evaluation and scalability of the algorithm are studied. I implement the algorithm ...

متن کامل

Affinity Propagation: Clustering Data by Passing Messages

AFFINITY PROPAGATION: CLUSTERING DATA BY PASSING MESSAGES Delbert Dueck Doctor of Philosophy Graduate Department of Electrical & Computer Engineering University of Toronto 2009 Clustering data by identifying a subset of representative examples is important for detecting patterns in data and in processing sensory signals. Such “exemplars” can be found by randomly choosing an initial subset of da...

متن کامل

Local and global approaches of affinity propagation clustering for large scale data

Recently a new clustering algorithm called ‘affinity propagation’ (AP) has been proposed, which efficiently clustered sparsely related data by passing messages between data points. However, we want to cluster large scale data where the similarities are not sparse in many cases. This paper presents two variants of AP for grouping large scale data with a dense similarity matrix. The local approac...

متن کامل

Response to Comment on “ Clustering by Passing Messages Between Data Points ”

This copy is for your personal, non-commercial use only. . clicking here colleagues, clients, or customers by , you can order high-quality copies for your If you wish to distribute this article to others . here following the guidelines can be obtained by Permission to republish or repurpose articles or portions of articles (this information is current as of July 6, 2010 ): The following resourc...

متن کامل

Evolutionary Clustering via Message Passing

When data are acquired at multiple points in time, evolutionary clustering can provide insights into cluster evolution and changes in cluster memberships while enabling performance superior to that obtained by independently clustering data collected at different time points. Existing evolutionary clustering methods typically require additional steps before and after the clustering stage to appr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Science

دوره 319 5864  شماره 

صفحات  -

تاریخ انتشار 2008